Circuit and system of a low density one-time programmable memory

ABSTRACT

A low density One-Time Programmable (OTP) memory is disclosed to achieve low gate count and low overhead in the peripheral circuits to save the cost. A maximum-length Linear Feedback Shift Register (LFSR) can be used to generate 2 n −1 address spaces from an n-bit address. The registers used in the address generator can have two latches. Each latch has two cross-coupled inverters with two outputs coupled to the drains of two MOS input devices, respectively. The inputs of the latch are coupled to the gates of the MOS input devices, respectively. The sources of the MOS input devices are coupled to the drains of at least one MOS device(s), whose gate(s) are coupled to a clock signal and whose source(s) are coupled to a supply voltage. The two latches can be constructed in serial with the outputs of the first latch coupled to the inputs of the second latch.

CROSS-REFERENCE TO RELATED APPLICATION

This application claims priority benefit of an U.S. Provisional Application No. 61/595,171, filed on Feb. 6, 2012 and entitled “CIRCUIT AND SYSTEM OF A LOW DENSITY ONE-TIME PROGRAMMABLE MEMORY,” which is hereby incorporated herein by reference.

BACKGROUND OF THE INVENTION

One-Time Programmable (OTP) memory is a memory that can be programmed once and only once. An OTP can be programmed from low to high resistance states, the so-called fuse, such as electrical fuse. Alternatively, an OTP can be programmed from high to low resistance states, the so-called anti-fuse. The programming means can apply a high voltage to an OTP element such as in anti-fuse. Alternatively, the programming means can apply a high current to flow through an OTP element such as in fuse. The OTP memory cell usually has a program selector coupled to an OTP element to switch the desirable OTP element to conduct a high current or high voltage applied.

An electrical fuse is a common OTP that can be constructed from a segment of interconnect, such as polysilicon, silicided polysilicon, silicide, metal, metal alloy, or some combination thereof. The metal can be aluminum, copper, other transition metals, or the non-aluminum metal gate for CMOS. One of the most commonly used electrical fuses is a CMOS gate, fabricated in silicided polysilicon, used as interconnect. The electrical fuse can also be one or more contacts or vias instead of a segment of interconnect. A high current may blow the contact(s) or via(s) into a very high resistance state. The OTP element can be an anti-fuse, where a high voltage makes the resistance lower, instead of higher. The anti-fuse can consist of one or more contacts or vias with an insulator in between. The anti-fuse can also be a CMOS gate coupled to a CMOS body with a thin gate oxide as insulator.

A conventional OTP memory cell is shown in FIG. 1. The cell 10 consists of an OTP element 11 and an NMOS program selector 12. The OTP element 11 is coupled to the drain of the NMOS 12 at one end, and to a positive voltage V+ at the other end. The gate of the NMOS 12 is coupled to a select signal (Sel), and the source is coupled to a negative voltage V−. When a high voltage is applied to V+ and a low voltage to V−, the OTP device 10 can be programmed by raising the select signal (Sel) to turn on the NMOS 12. One of the most common OTP elements is a silicided polysilicon, the same material and fabricated at the same time as a MOS gate. The size of the NMOS 12, as program selector, needs to be large enough to deliver the required program current for a few microseconds. The program current for a silicided polysilicon is normally between a few milliamps for a fuse with width of 40 nm to about 20 mA for a fuse with width about 0.6 um. As a result, the cell size of an electrical fuse using silicided polysilicon tends to be very large. The OTP cells 10 are usually organized as a two-dimensional array with all V+'s in the same columns coupled together as bitlines (BLs) and all Sel's in the same row coupled together as wordlines (WLs).

Another OTP memory cell 15 is shown in FIG. 1( b). The OTP memory cell has an OTP element 16 and a diode 17 as program selector. The OTP element 16 is coupled between an anode of the diode 17 and a high voltage V+. A cathode of the diode 17 is coupled to a low voltage V−. By applying a proper voltage between V+ and V− for a proper duration of time, the OTP element 16 can be programmed into high or low resistance states, depending on voltage/current and duration. The diode 17 can be a junction diode constructed from a P+ active region on N well and an N+ active region on the same N well as the P and N terminals of a diode, respectively. In another embodiment, the diode 17 can be a diode constructed from a polysilicon structure with two ends implanted by P+ and N+, respectively. The P or N terminal of either junction diode or polysilicon diode can be implanted by the same source or drain implant in CMOS devices. Either the junction diode or polysilicon diode can be built in standard CMOS processes without any additional masks or process steps. The OTP cells 15 can be organized as a two-dimensional array with all V+'s in the same columns coupled together as bitlines (BLs) and all Sel's in the same rows coupled together as wordline bars (WLBs).

Low density OTP memory (e.g. bit count no more than 256) can be used for chip ID, inventory control, parameter trimming, or configuration settings for SoC integration. Since the low density OTP size is very small, it is imperative having low pin count to further saving the overall size. To reduce pin count, the interface is better to be serial to save many address signals. The addresses are usually incremented or decremented automatically from a starting address after each access cycle.

FIG. 2( a) shows a block diagram of a typical 4-bit counter 20 that has T-type flip-flops 21-24 (TFF1-4), AND gates 25 and 26 coupled between TFF2-TFF3 and TFF3-TFF4, respectively. FIG. 2( b) shows a schematic 30 of a typical T flip-flop constructed from a D flip-flop 31 with an XOR 32. FIG. 3 shows a schematic of a typical D flip-flop 35 in almost any textbooks on CMOS circuit design. The DFF 35 is implemented as two stages of latches 36 and 37 gated by clocks with opposite phases. The total transistor count of the typical DFF in FIG. 3 is 24, or called 24T. An additional XOR (4T) and an AND gate (6T) are needed to construct a counter stage in FIGS. 2( a),(b) for a total of 34T, except that the first two counter stages can be simplified.

For a low density OTP, as small as 8-bit to 256-bit, designing the peripheral circuits needs to be very effective; otherwise the overhead would be very high. The counter and flip-flop according to the conventional designs are very ineffective. Hence, there is a need for an invention to achieve highly effective design for a low density OTP.

SUMMARY

The present invention relates to effective circuit and system designs for testing a one-time-programmable (OTP) memory. Embodiments of highly effective circuits and systems for low density OTPs are disclosed. Inventions to replace the conventional counters and flip-flop designs can greatly reduce OTP memory size and save cost.

In one embodiment, the counter to generate the next addresses can be replaced by a Linear Feedback Shift Register (LFSR) to save additional gates to implement T-flip-flops and to increment/decrement the addresses. A properly designed n-bit LFSR can generate addresses up to 2^(n)−1 with minimum gate overheads, though the addresses generated are not in increment or decrement manners. In another embodiment, the conventional latch can be designed as two cross-coupled inverters with NMOS input devices that are in serial with at least one NMOS pulldown, which is further gated with a clock to ground. Two stages of latches can be used to construct a DFF, clocked by opposite phases. The new DFF has only 16T, comparing with 24T in the conventional DFF design.

The invention can be implemented in numerous ways, including as a method, system, device, or apparatus (including graphical user interface and computer readable medium). Several embodiments of the invention are discussed below.

As a One-Time Programmable (OTP) memory, one embodiment can, for example, include at least a plurality of OTP cells. The at least one of the OTP cells includes at least: an OTP element fabricated in standard CMOS process; at least one address generator having a plurality of registers constructed as shift registers with the last shift register coupled to the first shift register and operating at each clock cycle; and at least one Exclusive OR (XOR) or equivalent gate being coupled as an input to a shift register and an output from a second shift register, while the other input of the XOR being coupled to a third shift register. The output of the shift registers being used as an address to access the OTP memory in each clock cycle.

As an embodiment in an integrated circuit, one embodiment can, for example, include at least one register constructed as a linear feedback shift register (LFSR) with the register outputs used as addresses to access an OTP memory array. The LFSR can be properly designed to reach maximum length of 2^(n)−1 for an n-bit LFSR. The DFF can be embodied as latches in two stages. Each latch has two cross-coupled inverters with two outputs having NMOS input devices that are in serial with at least one NMOS pulldowns, which is gated with a clock to ground. The inputs to the latches are coupled to the gates of the NMOS input devices. The outputs of the first latch are coupled to the inputs of the second latch. The clocks in the two latches have opposite phases.

As an electronics system, one embodiment can, for example, include at least a processor, and an OTP memory operatively connected to the processor. The OTP memory can include at least one register constructed as a linear feedback shift register (LFSR) with the register outputs used as addresses to access an OTP memory array. The LFSR can be properly designed to reach maximum length of 2^(n)−1 for an n-bit LFSR. The DFF can be embodied as latches in two stages. Each latch has two cross-coupled inverters with two outputs having two NMOS input devices in serial with at least one NMOS pulldowns, which is gated with a clock to ground. The inputs to the latches are coupled to the gates of the NMOS input devices. The outputs of the first latch are coupled to the inputs of the second latch. The clocks in the two latches have opposite phases.

As a method for providing effective embodiments for an OTP memory, one embodiment can, for example, include at least one register constructed as a linear feedback shift register (LFSR) with the register outputs used as addresses to access an OTP memory array. The LFSR can be properly designed to reach maximum length of 2^(n)−1 for an n-bit LFSR. The DFF can be embodied as latches in two stages. Each latch has two cross-coupled inverters with two outputs having two NMOS input devices in serial with at least one NMOS pulldowns, which is gated with a clock to ground. The inputs to the latches are coupled to the gates of the NMOS input devices. The outputs of the first latch are coupled to the inputs of the second latch. The clocks in the two latches have opposite phases.

BRIEF DESCRIPTION OF THE DRAWINGS

The present invention will be readily understood by the following detailed descriptions in conjunction with the accompanying drawings, wherein like reference numerals designate like structural elements, and in which:

FIG. 1( a) shows a conventional OTP memory cell using MOS as program selector.

FIG. 1( b) shows another OTP memory cell using diode as program selector.

FIG. 2( a) shows a schematic of a 4-bit counter.

FIG. 2( b) shows a schematic of a TFF constructed from a DFF.

FIG. 3 shows a schematic of a conventional DFF.

FIG. 4 shows one embodiment of a block diagram of a portion of OTP memory according to the present invention.

FIG. 5( a) shows a schematic of an n-bit LFSR in general.

FIG. 5( b) shows a schematic of another n-bit LFSR, an equivalent design as the LFSR in FIG. 5( a).

FIG. 5( c) shows a schematic of a 3-bit maximum length LFSR as an example.

FIG. 5( d) shows a schematic of a 3-bit maximum length LFSR, an equivalent design as the LFSR in FIG. 5( b).

FIG. 5( e) shows a schematic of implementation efficient asynchronous counter according to one embodiment.

FIG. 6 shows a table of maximum-length LFSRs with n up to 30.

FIG. 7( a) shows a schematic of one embodiment of a DFF according to the preset embodiment.

FIG. 7( b) shows a schematic of another embodiment of a DFF according to the preset embodiment.

FIG. 7( c) shows a schematic of yet another embodiment of a DFF according to the preset embodiment.

FIG. 8 shows a schematic of a tree decoder.

FIG. 9 depicts a method in a flow chart to use LFSR to generate addresses for an OTP memory.

FIG. 10 shows a processor system using OTP memory according to one embodiment.

DETAILED DESCRIPTION OF EMBODIMENTS OF THE INVENTION

Embodiments disclosed herein use innovations to reduce gate counts for a low density OTP memory. A counter with high gate count is replaced by a Linear Feedback Shift Register (LFSR) to generate addresses in a serial OTP memory. LFSR can generate almost the entire available address spaces with a proper design, except the all 0s state. The all 0s state can be multiplexed in and out at any time to reach the entire 2^(n) address spaces, the same effect as a counter, except that the addresses are not generated incremented or decremented but in a seemingly pseudo-random manner. Either counter or LFSR can be designed based on D-type flip-flops (DFFs). The conventional design for DFFs is based on pass gates to drive a pair of cross-coupled inverters that needs about 24 transistors (24T). A better DFF can be designed with two latches. Each latch has a pair of cross-coupled inverters as two outputs coupled to drains of a pair of NMOS input devices. The gates of the NMOS input devices are coupled to the differential inputs. The sources of NMOS input devices are coupled to the drain of at least one NMOS pulldown whose gate is coupled to a clock and whose source is coupled to ground. The two latches can be cascaded with the outputs of the first latch coupled to the inputs of the second latch to constitute a DFF. The clocks for the two latches have opposite phases. The new DFF has about only ⅔ of gate count as the conventional DFF.

FIG. 4 shows a block diagram of one embodiment of a portion of an OTP memory 40 according to the present invention. The OTP memory 40 has an OTP memory array 41, at least one address decoder 43, a LFSR 42, and a serial interface control logic 46. The control logic 46 takes input signals to determine if there is a valid access. If yes, the control logic 46 sends a signal to the LFSR 42 to generate an address automatically for the address decoder 43. The address decoder 43 then enables a wordline out of the total m wordlines, 49-1 to 49-m, to select a row. Similarly, the address decoder 43 also enables at least one Y-Pass Gate select (YPGS) out of the total n YPGS selects, 46-1 to 46-n, to select at least one column. If the access is a read, the YPGS can be used to to turn on at least one Y-Pass Gate (YPG) out of the total n YPGs, 44-1 to 44-n, by ANDing with a Read Enable Bar signal (REB) in AND gates 44′-1 to 44′-n, respectively. The outputs of the YPG can be coupled to at least one sense amplifier 45 to produce an output Q. The sense amplifier 45 has a reference resistor 45-1 and can be enabled by a Read Enable Bar signal (REB) generated from the control logic 46. If the access is a write, one of the YPGS can be used to turn on at least one Y-Pass Gate Write Select out of n YPGWSs, 48-1 to 48-n, by ANDing with a Write Enable Bar (WEB) signal in AND gates, 48-1 to 48-n, respectively. The outputs of the AND gates, 48-1 to 48-n, are used to select a Y-Pass Gate Write (YPGW) out of n YPGWs, 47-1 to 47-n, to allow high voltage going into the OTP memory array 41 for programming.

FIG. 5( a) depicts a general Linear Feedback Shift Register (LFSR) 60 as one embodiment for generating addresses automatically. The LFSR 60 has n-registers, 61-1 through 61-n, connected in serial and wrapped around, i.e. register 61-1 is coupled to register 61-2, register 61-2 is coupled to register 61-3, and register 61-n is coupled to register 61-1, etc. Each register is coupled to the next register through an XOR, i.e. the output of 61-1 is an input to an XOR 62-1 whose output is the input of the next register 61-2. The other input of the XOR 62-1 is a switch 63-1 that can be coupled to logic 0 or 1, i.e. to ground or to the output of the last register 61-n, respectively. The switches can be hardwired to 0 or 1. With proper setting in the switches, the register outputs can be unique and can have a run length of 2^(n)−1.

The operation principle of LFSR is very well known and can be found in almost any textbooks on logic design. Finding a maximum length LFSR is briefly explained as follows. A polynomial generator x^(n)+a_(n-1)x^(n-1)+ . . . +a₂x²+a₂x+1 can be assigned to a LFSR, where a_(i) is the value of the switch 62-i, i.e. a_(i)=0, if the switch 62-i is connected to logic 0, or a_(i)=1, if the switch 62-i is connected to the output of register 61-n. If the polynomial generator is primitive in the Galois Field of 2, then the LFSR can generate states with maximum length of 2^(n)−1, if the initial state is not 0 for all registers.

FIG. 5( b) shows a schematic of an equivalent embodiment of a general LFSR 60′ as the LFSR 60 shown in FIG. 5( a). The LFSR 60′ has n-registers, 61′-1 through 61′-n, connected in serial, i.e. register 61′-1 is coupled to register 61′-2, and register 61′-2 is coupled to register 61′-3 from the output to input, etc. N XORs are placed in serial with the output of the XOR 62′-3 coupled to the input of the XOR 62′-2 and the output of the XOR 62′-2 coupled to the input of the XOR 62′-1, etc. The input of the XOR 62′-(n−1) is coupled to the output of register 61′-n and the output of the XOR 62′-1 is coupled to the input of register 61-1. The other input of the XOR 62′-i is a switch 63′-i that can be coupled to logic 0 or 1, i.e. to ground or to the output of the register 61′-i, respectively. The switches can be hardwired to 0 or 1. With proper setting in the switches, the register outputs can be unique and can run length of 2^(n)−1.

FIG. 5( c) shows an example of a maximum length LFSR 70 with n=3. The LFSR 70 has three registers 71-1 to 71-3. The output of the register 71-3 is coupled to the input of the register 71-1. The output of the register 71-1 is coupled to an input of an XOR gate 72-1. The other input of the XOR 72-1 is coupled to the output of the register 71-3. The output of XOR 72-1 is coupled to the input of the register 71-2. The output of the register 71-2 is coupled to the input of the register 71-3. Since only the output of the register 71-1 has an XOR, the coefficient of x¹ is 1, while x² is 0. The coefficient of the x³ and x° are always 1, so that the generator is x³+x+1. This polynomial is primitive, i.e. has no other factors other than 1 and itself. Any n-bit LFSR design that has a primitive polynomial generator can have a maximum length of 2^(n)−1, if the starting state is not all 0s. If this LFSR starts with 001, the next states would be 100, 010, 011, 111, 101, 110, and 001. If the LFSR starts with 000, the next states will be always 000.

FIG. 5( d) shows an example of another equivalent embodiment of LFSR 70′, the same LFSR 70 shown in FIG. 5( c). The LFSR 70′ has three registers 71′-1 to 71′-3. The output of the register 71′-1 is coupled to the input of the register 71′-2, and the output of the register 71′-2 is coupled to the input of the register 71′-3. An XOR gate 72′-1 has inputs from the output of register 71′-1 and 71′-3 and has the output coupled to the input of the register 71′-1. Since only the output of the register 71′-1 has an XOR, the coefficient of x¹ is 1, while x² is 0. The coefficient of the x³ and x° are always 1, so that the generator is x³+x+1.

FIG. 5( e) shows an example of implementation efficient asynchronous counter 60″ according to one embodiment. The counter has DFF 62″-1 to 62″-n. The input D of 62″-1 is coupled to the complement output of Q1, Q1B, to toggle Q1 every cycle. The input Ds input of the DFFs 62″-2 to 62″-n are set to 1s. The complement output of Q1, Q1B is coupled to the clock of the next DFF 62″-2. The complement output of Q2, Q2B is coupled to the clock of the next DFF 62″-3. The same connection can be applied to the DFF 62″-3 through 62″-(n−1). In this configuration, the DFFs change states whenever the previous DFFs change states from 1 to 0 to realize an up-counter. Since the state changes are asynchronous to the clock, this is an asynchronous counter.

FIG. 6 lists a table of primitive polynomials with minimum numbers of XORs for n=2 to 30. If a LFSR is designed with a primitive polynomial, the states can be generated as many as a counter lesser than 1, but the total number of logic gates can be greatly reduced. The all 0s state can be prevented initially to generate a maximum length, and then this state can be multiplexed in and out any time to generate the full address space.

The above discussions about LFSR are for illustrative purposes, there are many and equivalent embodiments of LFSR designs that can achieve a maximum length of 2^(n)−1. The XORs can be replaced or implemented by XNORs, NANDs, NORs, or other logic gates. Moreover, there can be many embodiments similar to LFSRs that can generate maximum length of states close to 2^(n), and that are still within the scope of this invention for those skilled in the art.

FIG. 7( a) shows a schematic of one embodiment of a DFF 80 according to the present invention. The DFF has a first stage of latch including two cross-coupled inverters 82-1 and 82-2 having two outputs Q′ and QB′. The outputs Q′ and QB′ are coupled to the drains of NMOS devices 82-2 and 82-1, respectively. The gates of NMOS 82-1 and 82-2 are coupled to differential inputs D and DB, respectively. Their sources are coupled through a NMOS 83, with gate coupled to CKB, to ground. The second stage of the latch includes two cross-coupled inverters 84-1 and 84-2 with two outputs Q and QB. The outputs Q and QB are coupled to the drains of NMOS devices 85-1 and 85-2, respectively. The gates of NMOS 85-1 and 85-2 are coupled to the differential outputs Q′ and QB′ from the first latch, respectively. The sources of 85-1 and 85-2 are coupled through a NMOS 86, with gate coupled to CK, to ground. Two MOS 87-1 and 87-2 are used to reset to the outputs Q and QB by asserting a reset RS and a reset bar RSB to the gates of the NMOS pulldown 87-1 and to the gate of the PMOS pullup 87-2, respectively. The clocks for the first and second latches have opposite phases.

FIG. 7( b) shows a schematic of another embodiment of a DFF 90 according to the present invention. The DFF has a first stage of latch including two cross-coupled inverters 92-1 and 92-2 with two outputs Q′ and QB′. The outputs Q′ and QB′ are coupled to the drains of NMOS devices 92-2 and 92-1, respectively. The gates of the NMOS 92-1 and 92-2 are coupled to differential inputs D and DB, respectively. The sources of 92-1 and 92-2 are coupled to the drains of NMOS devices 93-1 and 93-2, respectively. The NMOS 93-1 and 93-2 have gates coupled to CKB and sources coupled to ground. The second stage of the latch includes two cross-coupled inverters 94-1 and 94-2 with two outputs Q and QB. The outputs Q and QB are coupled to the drains of NMOS devices 95-2 and 95-1, respectively. The gates of NMOS 95-1 and 95-2 are coupled to differential outputs QB′ and Q′ from the first latch, respectively. The sources of 95-1 and 95-2 are coupled to the drains of NMOS 96-1 and 96-2, respectively. The NMOS 96-1 and 96-2 have gates coupled to CK and sources coupled to ground. Two MOS 97-1 and 97-2 are used to reset to the output node Q by asserting a reset RS and a reset bar RSB to the gates of a NMOS pulldown 97-1 and to the gate of a PMOS pullup 97-2, respectively.

FIG. 7( c) shows a schematic of one embodiment of a DFF 80′ according to the present invention. The DFF has a first stage of latch including two cross-coupled inverters 82′-1 and 82′-2 having two outputs Q′ and QB′. The outputs Q′ and QB′ are coupled to the drains of NMOS input devices 82′-1 and 82′-2, respectively. The sources of NMOS 82′-1 and 82′-2 are coupled to differential inputs D and DB, respectively. The gates are coupled to CKB. The second stage of the latch includes two cross-coupled inverters 84′-1 and 84′-2 with two outputs Q and QB. The outputs Q and QB are coupled to the drains of NMOS devices 85′-2 and 85′-1, respectively. The sources of NMOS 85′-1 and 85′-2 are coupled to the differential outputs QB′ and Q′ from the first latch, respectively. The gates of 85′-1 and 85′-2 are coupled to CK. Two MOS 87′-1 and 87′-2 are used to reset to the outputs Q and QB by asserting a reset RS and a reset bar RSB to the gates of the NMOS pulldown 87′-1 and to the gate of the PMOS pullup 87′-2, respectively. The clocks for the first and second latches have opposite phases.

The DFF shown in FIGS. 7( a), 7(b), 7(c) are for illustrative purposes. The NMOS input and pulldown devices can be replaced by PMOS input and pullup devices. The reset devices can be a combination of NMOS or PMOS devices, or none and can be applied to the first, second, or both latches. The reset can be embodied as NAND or NOR gates instead of MOS pullup/pulldown devices. The above discussions are for exemplifying a concept of the invention. For those skilled in the art understand that there are many varieties of equivalent designs or configurations that can be embodied in part, all, or in any combinations and that are still within the scope of this invention.

The gate counts of an OTP memory can be further saved by using a tree decoder. Since the decoders are mainly NAND gates with addresses and address complement signals as inputs, some of the MOS devices in the logic gates of the decoders can be shared and saved. FIG. 8 shows a schematic of a 3-input tree decoder 100 with inputs A0/A0B, A1/A1B, and A2B to illustrate the concept. A decoder with A0B, A1B, and A2B has a PMOS pullup 101 coupled to three NMOS devices 102, 131, and 151 in serial to ground, which have gates coupled to A0B, A1B, and A2B, respectively. The drain of the PMOS 101 is coupled to an inverter 103, whose output node P is coupled to another inverter 104. The output of 104 is a wordline bar, WL0B, to select a row in the OTP memory. The node P is also coupled to a gate of another PMOS pullup 105 to hold the drain of PMOS 101. To save power, the gate of the 101 VPCB is usually a pre-charge signal waiting for addresses A0B, A1B, and A2B becoming ready to evaluate the decoding. Once the evaluation is done, the pre-charge signal VPCB is released to let the gate 105 to hold the node, if the decoder is evaluated not true, i.e. not all addresses A0B/A1B/A2B are high. The circuits 110, including 102, 101, 105, 103, and 104, can be replicated 3 times to generate the other wordline signals WL1B, WL2B, and WL3B, respectively, with the gates of the pulldown NMOS devices coupled to A0/A1B/A2B, A0B/A1/A2B, and A0/A1/A2B, respectively. Since the gates of the NMOS having sources coupled to ground are all coupled to A2B, they can be shared as a single NMOS shown as 151. By the same token, the gates of the pulldown NMOS having sources coupled to the drain of NMOS 151 can be shared as NMOS 131 and 132, whose gates are coupled to A1B and A1, respectively. With proper sharing, only the circuit block 110 needs to be replicated for the other three decoders to generate WL1B, WL2B, and WL3B, respectively. The same concept can be applied to the other decoders associated with A2 input, or to have more stacks in serial, or to the Y-decoder, etc.

FIG. 9 shows a flow chart 700 depicting a method to generate addresses in serial to access an OTP memory using a maximum-length LFSR, according to one embodiment. The procedure starts at 710 to prepare generating addresses to access the OTP memory. Then reset all DFFs to 0 and access the memory in the step 720. In the next clock cycle in step 730, set all DFFs=0 except DFF1=1 as a starting address for a LFSR in step 740. In the next cycle, go to the next LFSR state in step 750. Then, check if the new address in the LFSR goes around and reaches the starting address in step 760. If yes, stop the address generation since all possible addresses have been reached. If no, access the memory array in step 790 and go back to step 750 for the next clock cycle and the next LFSR state. This process continues until the checking in step 760 is affirmative, then the process stops in 799.

The flow chart shown in FIG. 9 depicting an address generation method 700 for an OTP memory in accordance with certain embodiments. The method 700 is described in the context an OTP memory, such as the OTP memory 41 in FIG. 4. In addition, although described as a flow of steps, one of ordinary skilled in the art will recognize that at least some of the steps may be performed in a different order, including simultaneously, or skipped.

FIG. 10 shows a processor system 600 according to one embodiment. The processor system 600 can include an OTP device 644, such as in a cell array 642, in OTP memory 640, according to one embodiment. The processor system 600 can, for example, pertain to a computer system. The computer system can include a Central Process Unit (CPU) 610, which communicate through a common bus 615 to various memory and peripheral devices such as I/O 620, hard disk drive 630, CDROM 650, OTP memory 640, and other memory 660. Other memory 660 is a conventional memory such as SRAM, DRAM, or flash, typically interfaces to CPU 610 through a memory controller. CPU 610 generally is a microcontroller, microprocessor, a digital signal processor, or other programmable digital logic devices. Memory 640 is preferably constructed as an integrated circuit, which includes the memory array 642 having at least one OTP device 644. The memory 640 typically interfaces to CPU 610 through a memory controller. If desired, the memory 640 may be combined with the processor, for example CPU 610, in a single integrated circuit.

The invention can be applied to any OTP memory that has OTP cells including an OTP element coupled to at least one program selectors. The OTP element can be a fuse or anti-fuse. The fuse can be an interconnect fuse or a single or plural of contact/via fuse. The interconnect fuse can include polysilicon, silicided polysilicion, silicide, polymetal, metal, metal alloy, thermally isolated active region, or some combinations thereof. One of the most common fuse is a CMOS gate used as an interconnect. The anti-fuse can be a contact/via with dielectric in between, or a CMOS gate coupled to a CMOS body with gate oxide in between. A diode can be used as program selector. The diode can be a junction diode constructed from a P+ active region on N well and an N+ active region on the same N well as the P and N terminals of the diode, respectively. In another embodiment, a diode can be constructed from a polysilicon structure with two ends implanted by P+ and N+ implants, respectively, In yet another embodiment, the diode can be an isolated active region with two ends implanted by P+ and N+ implants, respectively. The P or N terminal of junction, polysilicon, or active region diode can be implanted by the same source or drain implant in CMOS devices. Either the junction diode, polysilicon diode, or active region diode can be built in standard CMOS processes without any additional masks or process steps.

The invention can be implemented in a part or all of an integrated circuit in a Printed Circuit Board (PCB), or in a system. The OTP memory device can be fuse, (such as interconnect, contact, or via fuse) or anti-fuse. The interconnect fuse can be silicided or non-silicided polysilicon fuse, metal fuse, or thermally isolated active region fuse. The anti-fuse can be a gate-oxide breakdown anti-fuse, contact or via anti-fuse with dielectrics in-between. Though the program mechanisms are different, their logic states can be distinguished by different resistance values and can only be programmed once.

Additional information on programmable memory structures and their formation and usage can be found in: (1) U.S. patent application Ser. No. 13/026,650, filed on Feb. 14, 2011 and entitled “CIRCUIT AND SYSTEM FOR USING A POLYSILICON DIODE AS PROGRAM SELECTOR FOR RESISTIVE DEVICES IN CMOS LOGIC PROCESSES,” which is hereby incorporated herein by reference; (2) U.S. patent application Ser. No. 13/026,725, filed on Feb. 14, 2011 and entitled “CIRCUIT AND SYSTEM FOR USING A JUNCTION DIODE AS PROGRAM SELECTOR FOR RESISTIVE DEVICES,” which is hereby incorporated herein by reference; (3) U.S. patent application Ser. No. 13/026,725, filed on Feb. 14, 2011 and entitled “CIRCUIT AND SYSTEM OF USING JUNCTION DIODE AS PROGRAM SELECTOR FOR RESISTIVE DEVICES IN CMOS LOGIC PROCESSES,” which is hereby incorporated herein by reference; (4) U.S. patent application Ser. No. 13/026,650, filed on Feb. 14, 2011 and entitled “CIRCUIT AND SYSTEM OF USING POLYSILICON DIODE AS PROGRAM SELECTOR FOR RESISTIVE DEVICES IN CMOS LOGIC PROCESSES,” which is hereby incorporated herein by reference; and (5) U.S. patent application Ser. No. 13/471,704, filed on May 15, 2012 and entitled “CIRCUIT AND SYSTEM FOR USING A JUNCTION DIODE AS PROGRAM SELECTOR FOR ONE-TIME PROGRAMMABLE DEVICES,” which is hereby incorporated herein by reference.

The above description and drawings are only to be considered illustrative of exemplary embodiments, which achieve the features and advantages of the present invention. Modifications and substitutions of specific process conditions and structures can be made without departing from the spirit and scope of the present invention.

The many features and advantages of the present invention are apparent from the written description and, thus, it is intended by the appended claims to cover all such features and advantages of the invention. Further, since numerous modifications changes will readily occur to those skilled in the art, it is not desired to limit the invention to the exact construction and operation as illustrated and described. Hence, all suitable modifications and equivalents may be resorted to as falling within the scope of the invention. 

What is claimed is:
 1. A One-Time Programmable (OTP) memory, comprising: a plurality of OTP cells, at least one of the OTP cells comprising an OTP element fabricated in standard CMOS process; at least one address generator having a plurality of registers constructed as shift registers with the last shift register coupled to the first shift register and operating at each clock cycle; and at least one Exclusive OR (XOR) or equivalent gate being coupled (i) to provide an output that serves as an input to one of the shift registers, (ii) to receive as a first input an output from one of the shift registers, and (iii) to receive as a second input an output from another of the shift registers or from a set logic level, wherein the output of the shift registers being used as an address to access the OTP memory in each clock cycle.
 2. An OTP memory as recited in claim 1, wherein the address generator is a Linear Feedback Shift Register (LFSR) with maximum length to generate 2^(n)−1 address spaces from an n-bit address.
 3. An OTP memory as recited in claim 1, wherein the address generator is a Linear Feedback Shift Register (LFSR) with maximum length to generate 2^(n)−1 address spaces from an n-bit address and has the last state coupled between any states to generate the entire 2^(n) address spaces from an n-bit address.
 4. An OTP memory as recited in claim 1, wherein the OTP memory has bit count no more than 256 bits.
 5. An OTP memory as recited in claim 1, wherein the registers used in the address generator has two latches, and wherein each of the latches has two cross-coupled inverters with two outputs coupled to the drains of two MOS input devices, respectively.
 6. An OTP memory as recited in claim 1, wherein the addresses from the address generator are further coupled to at least one tree decoder to access the OTP memory array.
 7. An OTP memory as recited in claim 1, wherein the OTP element is a fuse that includes at least one of polysilicon, silicided polysilicon, silicide, polymetal, metal, metal alloy, thermally isolated active region, contact, or via.
 8. An OTP memory as recited in claim 1, wherein the OTP element is an anti-fuse that includes at least one of contact/via with dielectric in between or gate and MOS body with gate oxide in between.
 9. An OTP memory as recited in claim 1, wherein at least one OTP cell has at least one program selector that is a junction diode constructed from an active region in a CMOS well, and wherein the two terminals of the junction diode are implanted with the same source or drain implant in a CMOS process.
 10. An OTP memory as recited in claim 1, wherein at least one OTP cell has at least one program selector that is a polysilicon diode built on a polysilicon structure, and wherein the two ends of the polysilicon diode are implanted with the same source or drain implant in a CMOS process to serve as two terminals of the diode.
 11. An OTP memory as recited in claim 1, wherein at least one OTP cell has at least one program selector that is a diode built on an isolated active region, and wherein the two ends of the active region are implanted with the same source or drain implant in a CMOS process to serve as two terminals of the diode.
 12. An electronic system, comprising: a processor; and an OTP memory operatively connected to the processor, the OTP memory includes at least a plurality of OTP cells for providing data storage, each of the OTP cells comprising an OTP element coupled to at least one program selectors fabricated in a standard CMOS process; at least one address generator having a plurality of registers constructed as shift register with the last shift register coupled to the first shift register and operating at each clock cycle; and at least one Exclusive OR (XOR) or equivalent gate being coupled (i) to provide an output that serves as an input to one of the shift registers, (ii) to receive as a first input an output from one of the shift registers, and (iii) to receive as a second input an output from another of the shift registers or from a set logic level, wherein the output of the shift registers being used as an address to access the OTP memory in each clock cycle.
 13. An electronic system as recited in claim 12, wherein the address generator is a Linear Feedback Shift Register (LFSR) with maximum length to generate 2^(n)−1 address spaces from an n-bit address.
 14. An electronic system as recited in claim 12, wherein the registers used in the address generator has two latches, and wherein each of the latches has two cross-coupled inverters with two outputs coupled to the drains of two MOS input devices, respectively.
 15. An electronic system as recited in claim 12, wherein the address from the address generator is further coupled to at least one tree decoder to access the OTP memory array.
 16. An electronic system as recited in claim 12, wherein the program selector in the OTP memory cell is a junction diode constructed from an active region in a CMOS well, and wherein the two terminals of the junction diode are implanted with the same source or drain implant in a CMOS process.
 17. A method for providing a One-Time Programmable (OTP) memory, comprising: providing a plurality of OTP cells, at least one of the OTP cells include at least one OTP element coupled to at least one program selector fabricated in a standard CMOS process, at least one address generator operating at each clock cycle having a plurality of registers constructed as shift registers with the output of the last register coupled to the input of the first register, and at least one Exclusive OR (XOR) or equivalent gate being coupled (i) to provide an output that serves as an input to one of the shift registers, (ii) to receive as a first input an output from one of the shift registers, and (iii) to receive as a second input an output from another of the shift registers or from a set logic level; and accessing the OTP cells using the outputs of the registers as an address at each clock cycle. 